\begin{problem}{ROT13}{rot.in}{rot.out}{5 seconds}{32 megabytes (64 for Java)}


  The Byteland Aircraft Factory has recently developed a new type of jet plane.
  Naming the planes with numbers is not fashionable anymore, so the management decided to form a two-word name.
  To draw potential clients' attention, the name should have an additional property: when encoded with the ROT13 cipher
  it should still be legible --- the encoded form should differ only by the order of the words.

  Recall that the ROT13 cipher changes each letter to the one that lies $13$ characters away in the alphabet.
  To be more precise, the encoding follows the table below.

\begin{center}
\begin{tabular}{r||l}
original letter&\tt abcdefghijklmnopqrstuvwxyz
\\\hline
encoded letter&\tt nopqrstuvwxyzabcdefghijklm
\end{tabular}
\end{center}

      Write a program which:
      \begin{itemize}
        \item reads from the standard input the list of available words,
        \item calculates the number of different possible plane names,
        \item writes the result to the standard output.
      \end{itemize}


\InputFile
	The first line of the input consists of a single integer $n$ ($1 \le n \le 1\,000\,000$).
  In each of the next $n$ lines there is one word consisting of small letters of the English alphabet.
  Each word contains at least one character. The cumulative length of all the words does not exceed
  $1\,000\,000$ letters.


\OutputFile
	The first and only line of the output should contain one integer --- the total number 
  of different possible plane names.

\Example

\begin{example}
\exmp{
5
urwany
hejnal
pijany
krolik
gizmo
}{
2
}%
\end{example}
\end{problem}
